Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs
نویسندگان
چکیده
In this paper we establish an exponential lower bound on the size of syntactic non-deterministic read d-times branching programs for d ≤ log n/10 computing a class of monotone CNFs with a linear number of clauses. This result provides the first separation of classes NP and co-NP for syntactic branching programs with a logarithmic repetition and the first separation of syntactic non-deterministic branching programs with a logarithmic repetition from small monotone CNFs.
منابع مشابه
Two types of branching programs with bounded repetition that cannot efficiently compute monotone 3-CNFs
We prove exponential lower bounds for two classes of non-deterministic branching programs (nbps) with bounded repetition computing a class of functions representable by monotone 3-cnfs. The first class significantly generalizes monotone read-k-times nbps and the second class generalizes oblivious read k times branching programs. To the best of our knowledge, this is the first separation of mono...
متن کاملPartial matching width and its application to lower bounds for branching programs
We introduce a new structural graph parameter called partial matching width. In particular, for a graph G and V ⊆ V (G), the matching width of V is such a largest k such that for any permutation SV of vertices with V , there is a prefix SV ′ of SV such that there is a matching of size k and between SV ′ (being treated as a set of vertices) and G \ SV . For each (sufficiently large) integer k ≥ ...
متن کاملNo Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth
In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primary graphs such that the equivalent nondeterministic read-once branching programs (NROBPs) are of size at least n for some universal constant c. Thus we rule out the possibility of fixedparameter space complexity of NROBPs parameterized by the smallest treewidth of the equivalent CNF.
متن کاملOn the Power of Randomized Branching Programs
We deene the notion of a randomized branching program in the natural way similar to the deenition of a randomized circuit. We exhibit an explicit function f n for which we prove that: 1) f n can be computed by polynomial size randomized read-once ordered branching program with a small one-sided error; 2) f n cannot be computed in polynomial size by deterministic read-once branching programs; 3)...
متن کاملA Note on Amortized Branching Program Complexity
In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions f there is a branching program computing a doubly exponential number of copies of f which has linear size per copy of f . This result disproves a conjecture about non-uniform catalytic computation, rules out a certain type of bottleneck argument for proving non-monoto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1604.01560 شماره
صفحات -
تاریخ انتشار 2016